On the Stability and Ergodicity of an Adaptive Scaling Metropolis Algorithm
نویسنده
چکیده
The stability and ergodicity properties of an adaptive random walk Metropolis algorithm are considered. The algorithm adjusts the scale of the symmetric proposal distribution continuously based on the observed acceptance probability. Unlike the previously proposed forms of this algorithm, the adapted scaling parameter is not constrained within a predefined compact interval. This makes the algorithm more generally applicable and ‘automatic,’ with two parameters less to be adjusted. A strong law of large numbers is shown to hold for functionals bounded on compact sets and growing at most exponentially as ‖x‖ → ∞, assuming that the target density is smooth enough and has either compact support or super-exponentially decaying tails.
منابع مشابه
On the Stability and Ergodicity of Adaptive Scaling Metropolis Algorithms
The stability and ergodicity properties of two adaptive random walk Metropolis algorithms are considered. The both algorithms adjust the scaling of the proposal distribution continuously based on the observed acceptance probability. Unlike the previously proposed forms of the algorithms, the adapted scaling parameter is not constrained within a predefined compact interval. The first algorithm i...
متن کاملOn the Ergodicity of the Adaptive Metropolis Algorithm on Unbounded Domains
This paper describes sufficient conditions to ensure the correct ergodicity of the Adaptive Metropolis (AM) algorithm of Haario, Saksman, and Tamminen [8], for target distributions with a non-compact support. The conditions ensuring a strong law of large numbers and a central limit theorem require that the tails of the target density decay super-exponentially, and have regular enough convex con...
متن کاملOn the ergodicity properties of someadaptive MCMC algorithms
In this paper we study the ergodicity properties of some adaptive Markov chain Monte Carlo algorithms (MCMC) that have been recently proposed in the literature. We prove that under a set of verifiable conditions, ergodic averages calculated from the output of a so-called adaptive MCMC sampler converge to the required value and can even, under more stringent assumptions, satisfy a central limit ...
متن کاملOn the Containment Condition for Adaptive Markov Chain Monte Carlo Algorithms
This paper considers ergodicity properties of certain adaptive Markov chain Monte Carlo (MCMC) algorithms for multidimensional target distributions, in particular Adaptive Metropolis and Adaptive Metropoliswithin-Gibbs. It was previously shown by Roberts and Rosenthal (2007) that Diminishing Adaptation and Containment imply ergodicity of adaptive MCMC. We derive various sufficient conditions to...
متن کاملIntroduction to Monte Carlo Methods
Monte Carlo methods play an important role in scientific computation, especially when problems have a vast phase space. In this chapter an introduction to the Monte Carlo method is given. Concepts such as Markov chains, detailed balance, critical slowing down, and ergodicity, as well as the Metropolis algorithm are explained. The Monte Carlo method is illustrated by numerically studying the cri...
متن کامل